Heuristic Search for Manipulation Planning

نویسندگان

  • Caelan Reed Garrett
  • Tomás Lozano-Pérez
  • Leslie Pack Kaelbling
  • Albert R. Meyer
چکیده

Manipulation problems involving many objects present substantial challenges for planning algorithms due to the high dimensionality and multi-modality of the search space. Symbolic task planners can efficiently construct plans involving many entities but cannot incorporate the constraints from geometry and kinematics. Existing approaches to integrated task and motion planning as well as manipulation planning remain prohibitively slow to plan in these high-dimensional hybrid configuration spaces involving many objects. We present the FFRob algorithm for task and motion planning and the hybrid heuristic backward-forward (HHBF) planning algorithm for general manipulation planning. Both algorithms adapt heuristic ideas from one of the most successful symbolic planners in recent years, the FastForward (FF) planner, to continuous robotic planning domains. FFRob discretizes task and motion planning problems using a multi-query roadmap structure that can be conditionalized to model different placements of movable objects. This structure enables the planner to efficiently compute the FFRob heuristic which incorporates geometric and kinematic planning constraints to give a tight estimate of the distance to the goal. The resulting tightly integrated planner is simple and performs efficiently in a collection of tasks involving manipulation of many objects. HHBF generalizes this idea to planning with arbitrary manipulation primitives. It dynamically searches forward from the initial state towards the goal but uses a backward search from the goal, based on a simplified representation of the actions, to bias the sampling of the infinite action space towards action that are likely to be useful in reaching the goal. As a result, it can construct long manipulation plans in a large class of manipulation domains even more effectively than FFRob. For both algorithms, we empirically demonstrate their effectiveness on complex manipulation tasks. Thesis Supervisor: Tomás Lozano-Pérez Title: Professor Thesis Supervisor: Leslie Pack Kaelbling Title: Professor

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning to Avoid Local Minima in Planning for Static Environments

In many robot motion planning problems such as manipulation planning for a personal robot in a kitchen or an industrial manipulator in a warehouse, all motion planning queries are in an environment that is largely static. Consequently, one should be able to improve the performance of a planning algorithm by training on this static environment ahead of operation time. In this work, we propose a ...

متن کامل

Single- and Dual-Arm Motion Planning with Heuristic Search

Heuristic searches such as A* search are a popular means of finding least-cost plans due to their generality, strong theoretical guarantees on completeness and optimality, simplicity in implementation and consistent behavior. In planning for robotic manipulation, however, these techniques are commonly thought of as impractical due to the highdimensionality of the planning problem. In this paper...

متن کامل

A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters

Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...

متن کامل

FFRob: An Efficient Heuristic for Task and Motion Planning

Manipulation problems involving many objects present substantial challenges for motion planning algorithms due to the high dimensionality and multi-modality of the search space. Symbolic task planners can efficiently construct plans involving many entities but cannot incorporate the constraints from geometry and kinematics. In this paper, we show how to extend the heuristic ideas from one of th...

متن کامل

FFRob: Leveraging symbolic planning for efficient task and motion planning

Mobile manipulation problems involving many objects are challenging to solve due to the high dimensionality and multi-modality of their hybrid configuration spaces. Planners that perform a purely geometric search are prohibitively slow for solving these problems because they are unable to factor the configuration space. Symbolic task planners can efficiently construct plans involving many varia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015